- Sold out
/https://libri-media.knygos-static.lt/5958715b-a23a-4a56-bd3f-c8b10a16fc5a/1)
- Publisher: Springer-Verlag GmbH
- Year: 2006
- ISBN-10: 3540322124
- ISBN-13: 9783540322122
- Format: 15.7 x 23.9 x 2.2 cm, kieti viršeliai
- Language: English
Efficient Approximation and Online Algorithms (e-book) (used book) | bookbook.eu
Reviews
Description
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
- Publisher: Springer-Verlag GmbH
- Year: 2006
- ISBN-10: 3540322124
- ISBN-13: 9783540322122
- Format: 15.7 x 23.9 x 2.2 cm, kieti viršeliai
- Language: English English
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
Reviews